Learning Functions from Imperfect Positive Data
Identifieur interne : 001A19 ( Main/Exploration ); précédent : 001A18; suivant : 001A20Learning Functions from Imperfect Positive Data
Auteurs : Filip Železn [République tchèque]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2001.
Abstract
Abstract: The Bayesian framework of learning from positive noise-free examples derived by Muggleton [12] is extended to learning functional hypotheses from positive examples containing normally distributed noise in the outputs. The method subsumes a type of distance based learning as a special case. We also present an effective method of outlier-identification which may significantly improve the predictive accuracy of the final multi-clause hypothesis if it is constructed by a clause-by-clause covering algorithm as e.g. in Progol or Aleph. Our method is implemented in Aleph and tested on two experiments, one of which concerns numeric functions while the other treats non-numeric discrete data where the normal distribution is taken as an approximation of the discrete distribution of noise.
Url:
DOI: 10.1007/3-540-44797-0_21
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 002F99
- to stream Istex, to step Curation: 002D65
- to stream Istex, to step Checkpoint: 001073
- to stream Main, to step Merge: 001B12
- to stream Main, to step Curation: 001A19
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct:series"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Learning Functions from Imperfect Positive Data</title><author><name sortKey="Zelezn, Filip" sort="Zelezn, Filip" uniqKey="Zelezn F" first="Filip" last="Železn">Filip Železn</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:884DD384A65959DEB99E5A7290C659D2FFF07822</idno><date when="2001" year="2001">2001</date><idno type="doi">10.1007/3-540-44797-0_21</idno><idno type="url">https://api.istex.fr/document/884DD384A65959DEB99E5A7290C659D2FFF07822/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">002F99</idno><idno type="wicri:Area/Istex/Curation">002D65</idno><idno type="wicri:Area/Istex/Checkpoint">001073</idno><idno type="wicri:doubleKey">0302-9743:2001:Zelezn F:learning:functions:from</idno><idno type="wicri:Area/Main/Merge">001B12</idno><idno type="wicri:Area/Main/Curation">001A19</idno><idno type="wicri:Area/Main/Exploration">001A19</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Learning Functions from Imperfect Positive Data</title><author><name sortKey="Zelezn, Filip" sort="Zelezn, Filip" uniqKey="Zelezn F" first="Filip" last="Železn">Filip Železn</name><affiliation wicri:level="3"><country xml:lang="fr">République tchèque</country><wicri:regionArea>Center for Applied Cybernetics, Czech Technical University, Prague</wicri:regionArea><placeName><settlement type="city">Prague</settlement><region type="région" nuts="2">Bohême centrale</region></placeName></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2001</date></imprint><idno type="ISSN">0302-9743</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">884DD384A65959DEB99E5A7290C659D2FFF07822</idno><idno type="DOI">10.1007/3-540-44797-0_21</idno><idno type="ChapterID">21</idno><idno type="ChapterID">Chap21</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: The Bayesian framework of learning from positive noise-free examples derived by Muggleton [12] is extended to learning functional hypotheses from positive examples containing normally distributed noise in the outputs. The method subsumes a type of distance based learning as a special case. We also present an effective method of outlier-identification which may significantly improve the predictive accuracy of the final multi-clause hypothesis if it is constructed by a clause-by-clause covering algorithm as e.g. in Progol or Aleph. Our method is implemented in Aleph and tested on two experiments, one of which concerns numeric functions while the other treats non-numeric discrete data where the normal distribution is taken as an approximation of the discrete distribution of noise.</div></front></TEI><affiliations><list><country><li>République tchèque</li></country><region><li>Bohême centrale</li></region><settlement><li>Prague</li></settlement></list><tree><country name="République tchèque"><region name="Bohême centrale"><name sortKey="Zelezn, Filip" sort="Zelezn, Filip" uniqKey="Zelezn F" first="Filip" last="Železn">Filip Železn</name></region></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/OcrV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001A19 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 001A19 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= OcrV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:884DD384A65959DEB99E5A7290C659D2FFF07822
|texte= Learning Functions from Imperfect Positive Data
}}
| This area was generated with Dilib version V0.6.32. |  |